On the stability of the Erdős-Ko-Rado theorem
نویسندگان
چکیده
Delete the edges of a Kneser graph independently of each other with some probability: for what probabilities is the independence number of this random graph equal to the independence number of the Kneser graph itself? We prove a sharp threshold result for this question in certain regimes. Since an independent set in the Kneser graph is the same as a uniform intersecting family, this gives us a random analogue of the Erdős–Ko–Rado theorem.
منابع مشابه
Elementary Techniques for Erdős–Ko–Rado-like Theorems
The well-known Erdős–Ko–Rado Theorem states that if F is a family of k-element subsets of {1, 2, . . . , n} (n ≥ 2k) satisfying S, T ∈ F ⇒ |S ∩ T | ≥ 1, then |F| ≤ ( n−1 k−1 ) . The theorem also provides necessary and sufficient conditions for attaining the maximum. We present elementary methods for deriving generalizations of the Erdős– Ko–Rado Theorem on several classes of combinatorial objec...
متن کاملTowards a Katona Type Proof for the 2-intersecting Erdos-Ko-Rado Theorem
We study the possibility of the existence of a Katona type proof for the Erdős-Ko-Rado theorem for 2and 3-intersecting families of sets. An Erdős-Ko-Rado type theorem for 2-intersecting integer arithmetic progressions and a model theoretic argument show that such an approach works in the 2-intersecting case.
متن کاملShifting shadows: the Kruskal–Katona Theorem
As we have seen, antichains and intersecting families are fundamental to Extremal Set Theory. The two central theorems, Sperner’s Theorem and the Erdős–Ko–Rado Theorem, have inspired decades of research since their discovery, helping establish Extremal Set Theory as a vibrant and rapidly growing area of Discrete Mathematics. One must, then, pay a greater than usual amount of respect to the Krus...
متن کاملThe Erdős-Ko-Rado basis for a Leonard system
We introduce and discuss an Erdős–Ko–Rado basis of the vector space underlying a Leonard system Φ = ( A;A∗; {Ei}i=0; {E∗ i }i=0 ) that satisfies a mild condition on the eigenvalues of A and A∗. We describe the transition matrices to/from other known bases, as well as the matrices representing A and A∗ with respect to the new basis. We also discuss how these results can be viewed as a generaliza...
متن کاملA p-part Erdős-Ko-Rado theorem
We prove a p-part extension of the Erdős-Ko-Rado Theorem and suggest several related open problems. For the basic case of two parts we describe two proofs, a combinatorial one and a spectral one.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Comb. Theory, Ser. A
دوره 137 شماره
صفحات -
تاریخ انتشار 2016